The discrete ellipsoid covering problem: A discrete geometric programming approach
نویسندگان
چکیده
منابع مشابه
Discrete time McKean-Vlasov control problem: a dynamic programming approach
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate l...
متن کاملA mixed-discrete bilevel programming problem
We investigate a special mixed-discrete bilevel programming problem resulting from the task to compute cash-out penalties due to the supply of incorrect amounts of natural gas through large gas networks. For easier solution we move the discreteness demand from the lower to the upper levels. This clearly changes the problem and it is our aim to investigate the relations between both problems. Af...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملDynamic Programming Approach for Solving Discrete Optimal Control Problem
Time discrete systems determined by systems of difference equations are considered. The characterizations of their optimal trajectories with given starting and final states is studied. An algorithm based on dynamic programming technique for determining such trajectories is proposed. In additional multicriterion version for considered control model is formulated and a general algorithm for deter...
متن کاملCovering by Discrete and Closed Discrete Sets
Say that a cardinal number κ is small relative to the space X if κ < ∆(X), where ∆(X) is the least cardinality of a non-empty open set in X . We prove that no Baire metric space can be covered by a small number of discrete sets, and give some generalizations. We show a ZFC example of a regular Baire σ-space and a consistent example of a normal Baire Moore space which can be covered by a small n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.10.016